Optimizing product assortment under customer-driven demand substitution

نویسندگان

  • Eda Yücel
  • Fikri Karaesmen
  • F. Sibel Salman
  • Metin Türkay
چکیده

The problem of product assortment and inventory planning under customer-driven demand substitution is analyzed and a mathematical model for this problem is provided in this paper. Realistic issues in a retail context such as supplier selection, shelf space constraints, and poor quality procurement are also taken into account. The performance of three modified models, one that neglects customers’ substitution behavior, another that excludes supplier selection decision, and one that ignores shelf space limitations, are analyzed separately with computational experiments. The results of the analysis demonstrate that neglecting customer-driven substitution or excluding supplier selection or ignoring shelf space limitations may lead to significantly inefficient assortments. The effects of demand variability and substitution cost on optimal assortment and supplier selection decisions as well as on the optimal revenue are also investigated. The main contribution of this paper is the development of a practical and flexible model to aid retailers in finding optimal assortments to maximize the expected profit. 2008 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assortment Planning and Inventory Decisions Under Stockout-Based Substitution

Given a finite set of products with varying prices and costs, stochastic demand and customer preferences, we consider the problem of determining the optimal assortment and inventory levels in order to maximize expected profit in a single-period. We model customer preferences through the definition of customer types, where a type is a ranking of the potential products by order of preference. A c...

متن کامل

Fixed versus Random Proportions Demand Models for the Assortment Planning Problem under Stock-out based Substitution

We consider the problem of determining the optimal assortment of products to offer in a given product category when each customer is characterized by a type, which is a list of products he is willing to buy in decreasing order of preference. We assume consumer-driven, dynamic, stock-out based substitution and random proportions of each type. No efficient method to obtain the optimal solution fo...

متن کامل

Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand

Assortment planning of substitutable products is a major operational issue that arises in many industries, such as retailing, airlines and consumer electronics. We consider a single-period joint assortment and inventory planning problem under dynamic substitution with stochastic demands, and provide complexity and algorithmic results as well as insightful structural characterizations of near-op...

متن کامل

Heuristics for the Assortment Planning Problem under Ranking-based Consumer Choice Models

We model a retailer’s assortment planning problem under a ranking-based choice model of consumer preferences. Under this consumer choice model each customer belongs to a type, where a type is a ranking of the potential products by the order of preference, and the customer purchases his highest ranked product (if any) offered in the assortment. In our model we consider products with different pr...

متن کامل

Assortment Planning Under the Multinomial Logit Model with Totally Unimodular Constraint Structures

We consider constrained assortment problems assuming that customers select according to the multinomial logit model (MNL). The objective is to find an assortment that maximizes the expected revenue per customer and satisfies a set of totally unimodular constraints. We show that this fractional binary problem can be solved as an equivalent linear program. We use this result to solve five classes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 199  شماره 

صفحات  -

تاریخ انتشار 2009